An Inverse-A kermann Type Lower Bound for Online Minimum Spanning Tree Veri ation

نویسنده

  • Seth Pettie
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree Verification Problem

We consider the problem of preprocessing an edgeweighted tree in order to quickly answer queries of the following type: does a given edge belong in the minimum spanning tree of ? Whereas the offline minimum spanning tree verification problem admits a lovely linear time solution, we demonstrate an inherent inverseAckermann type tradeoff in the online MST verification problem. In particular, any ...

متن کامل

An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree

We consider the problem of preprocessing an edgeweighted tree T in order to quickly answer queries of the following type: does a given edge e belong in the minimum spanning tree of T [ feg? Whereas the offline minimum spanning tree verification problem admits a lovely linear time solution, we demonstrate an inherent inverseAckermann type tradeoff in the online MST verification problem. In parti...

متن کامل

An Inverse-Ackermann Type Lower Bound For Online Minimum Spanning Tree Verification

Given a spanning tree T of some graph G, the problem of minimum spanning tree verification is to decide whether T = MST (G). A celebrated result of Komlós shows that this problem can be solved with a linear number of comparisons. Somewhat unexpectedly, MST verification turns out to be useful in actually computing minimum spanning trees from scratch. It is this application that has led some to w...

متن کامل

A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem

The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...

متن کامل

Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs

We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequence of edge weight changes and has to choose a minimum spanning tree after each such change in the graph. The task of the algorithm is to perform as few changes in its minimum spanning tree as possible. We compare the number o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007